Counting Linear Extensions of Sparse Posets
نویسندگان
چکیده
Counting the linear extensions of a partially ordered set (poset) is a fundamental problem with several applications. We present two exact algorithms that target sparse posets in particular. The first algorithm breaks the counting task into subproblems recursively. The second algorithm uses variable elimination via inclusion–exclusion and runs in polynomial time for posets with a cover graph of bounded treewidth.
منابع مشابه
P-partitions revisited
We compare a traditional and non-traditional view on the subject of P-partitions, leading to formulas counting linear extensions of certain posets.
متن کاملThe complexity of counting poset and permutation patterns
We introduce a notion of pattern occurrence that generalizes both classical permutation patterns as well as poset containment. Many questions about pattern statistics and avoidance generalize naturally to this setting, and we focus on functional complexity problems – particularly those that arise by constraining the order dimensions of the pattern and text posets. We show that counting the numb...
متن کاملNear-linear time simulation of linear extensions of a height-2 poset with bounded interaction
A linear extension of a poset ([n], ) is a permutation σ such that if σ(i) σ( j), then i ≤ j. The problem considered here is sampling uniformly from the set of linear extensions. The best known algorithm for the general problem requires time O(n3 lnn). This work presents the first new method that is provably faster for a nontrivial class of posets. Specifically, when the poset is height-2 (so t...
متن کاملA Counting of the minimal realizations of the posets of dimension two
The posets of dimension 2 are those posets whose minimal realizations have two elements, that is, which may be obtained as the intersection of two of their linear extensions. Gallai's decomposition of a poset allows for a simple formula to count the number of the distinct minimal realizations of the posets of dimension 2. As an easy consequence, the characterization of M. El-Zahar and of N.W. S...
متن کاملCounterexamples to conjectures about Subset Takeaway and counting linear extensions of a Boolean lattice
We develop an algorithm for efficiently computing recursively defined functions on posets. We illustrate this algorithm by disproving conjectures about the game Subset Takeaway (Chomp on a hypercube) and computing the number of linear extensions of the lattice of a 7-cube and related lattices.
متن کامل